A characterization of definability of second-order generalized quantifiers with applications to non-definability
نویسندگان
چکیده
Article history: Received 14 January 2012 Received in revised form 21 February 2013 Accepted 3 February 2014 Available online 4 April 2014
منابع مشابه
Characterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملConnection Matrices and the Definability of Graph Parameters
In this paper we extend and prove in detail the Finite Rank Theorem for connection matrices of graph parameters definable in Monadic Second Order Logic with counting (CMSOL) from B. Godlin, T. Kotek and J.A. Makowsky (2008) and J.A. Makowsky (2009). We demonstrate its vast applicability in simplifying known and new non-definability results of graph properties and finding new non-definability re...
متن کاملRamsey Theory Is Needed for Solving Definability Problems of Generalized Quantifiers
In recent years, generalized quantifiers (see [H3]) have received quite a lot of novel interest because of their applications to computer science and linguistics. Their definability theory has made considerable progress during the last decade, which will be the subject of the next section. The proofs of many of these results often use results of Ramsey theory, such as theorems of van der Waerde...
متن کاملHenkin and Function Quantifiers
Henkin [7] introduced quantifiers which arise when usual (universal and existential) quantifiers are arranged in non-linear order. These quantifiers bre known as partially ordered quantifiers or Henkin quantifiers. Is. was observed already in [7] that languages with these quantifiers are stronger than first-order logic. A result of [ll] shows that even the weakest enkin quantifier has essential...
متن کاملOn the Expressive Power of Monotone Natural Language Quantifiers over Finite Models
We study definability in terms of monotone generalized quantifiers satisfying Isomorphism closure, Conservativity and Extension. Among the quantifiers with the latter three properties — here called CE quantifiers — one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 80 شماره
صفحات -
تاریخ انتشار 2014